An Improved Dynamic Probabilistic Packet Marking Algorithm
نویسندگان
چکیده
منابع مشابه
An Accurate Termination Condition of the Probabilistic Packet Marking Algorithm
Denial-of-service (DoS) attacks pose an increasing threat to today’s Internet. One major difficulty to defend against Distributed Denial-of-service attack is that attackers often use fake, or spoofed IP addresses as the IP source address. Probabilistic packet marking algorithm (PPM), allows the victim to trace back the appropriate origin of spoofed IP source address to disguise the true origin....
متن کاملDynamic probabilistic packet marking for efficient IP traceback
Recently, denial-of-service (DoS) attack has become a pressing problem due to the lack of an efficient method to locate the real attackers and ease of launching an attack with readily available source codes on the Internet. Traceback is a subtle scheme to tackle DoS attacks. Probabilistic packet marking (PPM) is a new way for practical IP traceback. Although PPM enables a victim to pinpoint the...
متن کاملAdjusted Probabilistic Packet Marking for
Distributed denial-of-service attack is one of the greatest threats to the Internet today. One of the biggest diiculties in defending against this attack is that attackers always use incorrect, or \spoofed" IP source addresses to disguise their true origin. In this paper, we present a packet marking algorithm which allows the victim to traceback the approximate origin of spoofed IP packets. The...
متن کاملT A Resolved IP Traceback through Probabilistic Packet Marking Algorithm
The major problem of network security in present years is DoS (Denial of Service) attacks, in order to protect the network from these attacks a research is implemented in the key streams of network security. Packet marking is always required to track few details of packet like its source and the status toward reaching the destination. In most of the cases, packets transmitted by a source are lo...
متن کاملMarkov Chain Modelling of the Probabilistic Packet Marking Algorithm
In this work, we show that the current termination condition of the probabilistic packet marking (PPM in short) algorithm is not correct for general networks, and this implies the estimation of expected number of marked packets is not accurate. As a result, this may lead to an incomplete attack graph construction. To remedy this problem, we propose a Markov chain modeling of the PPM algorithm. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Wireless and Microwave Technologies
سال: 2011
ISSN: 2076-1449,2076-9539
DOI: 10.5815/ijwmt.2011.05.04